High-Speed Pipeline Implementation of Radix-2 DIF Algorithm
نویسندگان
چکیده
In this paper, we propose a new architecture for the implementation of the N-point Fast Fourier Transform (FFT), based on the Radix-2 Decimation in Frequency algorithm. This architecture is based on a pipeline circuit that can process a stream of samples and produce two FFT transform samples every clock cycle. Compared to existing implementations the architecture proposed achieves double processing speed using the same circuit complexity. Keywords—Digital signal processing, systolic circuits, FFT algorithm.
منابع مشابه
High - Speed Pipeline Implementation of Radix - 2 DIF Algorithm
In this paper, we propose a new architecture for the implementation of the N-point Fast Fourier Transform (FFT), based on the Radix-2 Decimation in Frequency algorithm. This architecture is based on a pipeline circuit that can process a stream of samples and produce two FFT transform samples every clock cycle. Compared to existing implementations the architecture proposed achieves double proces...
متن کاملHigh-speed and low-power split-radix FFT
This paper presents a novel split-radix fast Fourier transform (SRFFT) pipeline architecture design. A mapping methodology has been developed to obtain regular and modular pipeline for split-radix algorithm. The pipeline is repartitioned to balance the latency between complex multiplication and butterfly operation by using carry-save addition. The number of complex multiplier is minimized via a...
متن کاملImplementation of Optimized 128-point Pipeline Fft Processor Using Mixed Radix 4-2 for Ofdm Applications
Abstract This paper proposes a 128-point FFT processor for Orthogonal Frequency Division Multiplexing (OFDM) systems to process the real time high speed data based on cached-memory architecture (CMA) with the resource Mixed Radix 4-2 algorithm using MDC style. The design and implementation of FFT processor has been done using the above technique to reduce the size and power. Using the above alg...
متن کاملImplementation of Efficient CORDIC Array Structure Based Fast RADIX-2 DCT Algorithm
A modern coordinate rotation digital computer (CORDIC)-based fast radix-2 algorithm for computation of discrete cosine transformation DCT). The planned algorithm has some distinguish advantages, such as Cooley-Tukey fast Fourier transformation (FFT)-like regular data flow, uniform post-scaling factor, in-place computation and arithmetic sequence rotation angles. Compared to existing DCT algorit...
متن کاملHierarchical Optimizations for High Speed Implementation of Modular Exponentiation in ASIC
This paper presents a new arithmetic architecture hierarchically optimized for implementing modular exponentiation in ASIC. We combine a new version of high radix Montgomery multiplication algorithm with a super-pipeline design. With this algorithm, modular exponentiation (ME) can be decomposed into a series of primitive operation (PO) matrixes. All the POs are scheduled on the pipeline by empl...
متن کامل